∂22-Jul-77  1047	JMC  
To:   PAT    
Please mail a copy of HOTER to
NORMAN ALSTER
45 DAVENPORT ST.
CAMBRIDGE, MASS. 02140

∂20-Jul-77  2106	JMC  
To:   suzuki at PARC-MAXC   
I assume you would include the predicate ATOM as well.  My idea that it
is decideable also came from almost pushing through a decision
procedure that involved quantifier elimination.  DCO's decideability
is a part of a larger picture which he will doubtless explain.  If you
have written yours, I would like to see it.

∂19-Jul-77  2332	JMC  	reference
To:   PAT    
Please get me a xerox of this paper from the philosophy library.
%3Dennett, D.C.%1 (1971) Intentional Systems.  %2Journal of Philosophy%1
vol. 68, No. 4, Feb. 25.

∂19-Jul-77  1238	JMC  
To:   LES, RWW, CG
Chris Goad got an IBM fellowship.

∂18-Jul-77  2036	JMC  	Dungeon  
To:   TVR    
In accordance with our agreement to share the results of digging and your
suggestion that DIG WITH SHOVEL differs from DIG, I re-explored the river
and discovered that DIG WITH SHOVEL four times on the bank west of the
buoy turns up a statue worth 23 points.

∂17-Jul-77  2120	JMC  
To:   TVR    
I tried tying the bat with the wire - with the usual provocative results.

∂16-Jul-77  1138	JMC  	Saving state  
To:   DUNGEON at MIT-DMS    
Because we can't save state, the game gets increasingly tedious.
Suggest that macros be allowed in command language and that
it be possible to type out (into a script file) a suitably encoded
version of the state that can be put back in.

∂15-Jul-77  2107	JMC  	III Technical Committee 
To:   ef at MIT-AI
The meeting conflicts with the last days of IJCAI and hence should be changed.

∂15-Jul-77  1752	JMC  	Chapter 4
To:   CLT    
I have looked at chapter 4 and tinkered with the content a bit using
your copy.  The form seems ok.
Let's discuss proving the correctness of samefringe when you get a
chance.

∂15-Jul-77  1316	JMC  
To:   geoff at SRI-KA  
Yes, why not phone me sometime when you see me logged in and active?

∂13-Jul-77  0535	JMC  
To:   dungeon at MIT-DMS    
I burned book with torch in living room.

our state.  You can't have
everything.
I'm sorry, you seem to have encountered an error in the program.
Send mail to DUNGEON@MIT-DMS describing what it was you tried to do.

NTH-REST-PUT-OUT-OF-RANGE!-ERRORS 
BURNER 
Your score is 259 [total of 448 points], in 547 moves.
This score gives you the rank of Adventurer.

∂11-Jul-77  1130	JMC  
CC:   sherwood at SRI-KL    
les DIALNE[W77,JMC] is a pub file or mail pat@SAIL for hard copy.

∂11-Jul-77  0255	JMC  
To:   geoff at SRI-KA  
Thanks.  Got help from system help.

∂11-Jul-77  0238	JMC  
To:   geoff at SRI-KA  
How can I kill an su-ai job on sri-kl?  I lost contact with it.

∂10-Jul-77  1020	JMC  
CC:   geoff at SRI-KL, mmcm at SRI-KL 
Getting NS improved free of charge sounds great to me, and all the specific
ideas mentioned sound good.  The answer is yes, and I will dust off some of
my dormant ideas also.  I would like to get together in about a week.
The problem of efficiency should be discussed with JBR.

∂09-Jul-77  1355	JMC  
To:   dungeon at MIT-DMS    
Giving bottle to cyclops (not water) causes UNBOUND VAR.PRSOBJ LVAL.

∂08-Jul-77  2352	JMC  
To:   blohm at SUMEX-AIM    
Thanks for the reminder about the account.

∂08-Jul-77  1743	JMC  
To:   WP
It would be fine if you would write something.  There has to be a theorem
that the formal manipulations produce a schema that is correct.

∂08-Jul-77  1603	JMC  	Moore thesis proposal.  
To:   minsky at MIT-AI, phw at MIT-AI, gjs at MIT-AI
To:   papert at MIT-AI  
I have read Moore's thesis proposal, and I think if he carries it out
successfully, it will be a good thesis.  Of course, it will be a
theoretical thesis, but I think we need some of those.

∂08-Jul-77  1306	JMC  
To:   Testt at MIT-MULTICS  
Does mltx refuse mail to the non-existent?

∂08-Jul-77  1304	JMC  
To:   Dertouzos at MIT-MULTICS   
The check arrived.  Many thanks.

∂07-Jul-77  2355	JMC  	bug 
To:   dungeon at MIT-DMS    
Bare-handed sw from timber room, then north falls in pit, attempt to
be revived leads to complaint about bug.  I don't have screen now
but a variable called LAMPVAL is mentioned.

∂07-Jul-77  2256	JMC  
To:   LES    
 ∂07-Jul-77  2110	MRC   via AI	Call   
Sorry I was very tied up today.  I am at the MIT AI Lab now; you can call me
there tommorrow sometime.

∂07-Jul-77  1356	JMC  
To:   DEW    
I have a problem on which you might have a suggestion.

∂07-Jul-77  1345	JMC  	Oral chairman 
To:   TJW    
He is Prof. Peter Winkler, Math. Dept. and would like a copy of your
thesis draft and (if it exists) a reference to a survey article.

∂06-Jul-77  2036	JMC  
To:   RDR    
1. Mark has not yet, so far as I know, accepted our offer.

2. The Dialnet project will pay for whatever equipment the
project needs.

∂06-Jul-77  2035	JMC  
To:   RD
1. Mark has not yet, so far as I know, accepted our offer.

2. The Dialnet project will pay for whatever equipment the
project needs.

∂06-Jul-77  1334	JMC  
To:   query2 at USC-ISIC    
To Doug Cage:
The Dialnet project is getting started, and there may be
experimental protocols available in nine months though not
in three.  You may also be interested in PCNET, oriented
specifically to hobbyists.  You can inquire about it from
Dave Caulkins who can be reached c/o PBARAN@ISI.
				John McCarthy

∂05-Jul-77  1707	JMC  
To:   RWW    
 ∂05-Jul-77  1706	FTP:PRATT at MIT-AI (Vaughan Pratt)
Date: 5 JUL 1977 2005-EDT
From: PRATT at MIT-AI (Vaughan Pratt)
To: rpg at SU-AI, jmc at SU-AI, dav at SU-AI

Is MLISP available under UCI-LISP?

∂05-Jul-77  1649	JMC  	NSF Proposal  
To:   LES    
NSF[E77,JMC] is a draft of a proposal to NSF.  Could you PUBify it and
put in a budget in accordance with the notes on budget?  It will require
more fiddling with the content, and Richard and I are doing it, but I
guess we a proceeding rapidly enough so these other things may be in the
critical path.

∂04-Jul-77  1939	JMC  
To:   pratt at MIT-AI  
Well, that can't be the full reason why I don't like the subscript
notation.  My initial negative reaction came from looking at Pascal
where no other function names are provided.  How about n*x for
(cdr↑n)x and n.x for car cdr↑n x?  Do you see objections to using
numbers as functions?

∂04-Jul-77  1805	JMC  
To:   pratt at MIT-AI  
The objection to using "x↓1" for (CAR X) is that you then need other names
for the functions themselves.  Writing them as a subscripts obscures the
fact that they may be treated as any other functions.  My present opinion
is that writing (1 X) for (CAR X) and (2 X) for (CADR X) is a good
solution if one doesn't mind the asymmetry.  This is in line with an old
memo of Dana Scott in which he defined the numbers as λ-expressions that
take successive elements of a list.  One still needs a name for CDR.  (2 2
X) would be (CADADR X).

Another possibility is to reserve the numbers as names for the iterates of
CDR, i.e. (0 X) = X, (1 X) = (CDR X), etc.  Then we need another name for
CAR, suppose it were A.  We would then write (A 2 X) for (CADDR X).

∂04-Jul-77  1011	JMC  
To:   DON    
That was to have been my hint.

∂03-Jul-77  2252	JMC  
To:   PRATT at MIT-AI  
Take a look at MICROM[E77,JMC]

∂03-Jul-77  1130	JMC  
To:   marc at MIT-DMS  
The file is COREWA[S77,JMC]

∂02-Jul-77  1823	JMC  	error    
To:   dungeon at MIT-DMS    
Entering LLD, going out, and exercising again apparently excited a bug.
script.zor[e77,jmc] has full record.

∂02-Jul-77  1150	JMC  
To:   DAS    
Your message about albums misdirected.  Maybe you meant John Chowning?

∂01-Jul-77  0122	JMC  
To:   pratt at MIT-AI  
maintained chiefly at XEROX Palo Alto Research Center

∂30-Jun-77  2353	JMC  
To:   PAT    
If not too long, IJCAI.C pubbed to IJCAI.xgp[e77, is ready; phone if trouble.

∂29-Jun-77  1617	JMC  
To:   RWW    
How many FOL steps to prove ∀u.(u ε {x,y,z} ≡ u=x ∨ u=y ∨ u=z)?

∂28-Jun-77  2056	JMC   at TTY15  2056
To:   JMC    
subject :mazda
since you have several mazdas, you can always swap the alternaters around
among them.

whit

∂28-Jun-77  1310	JMC  
To:   RCM    
Thanks for the comments.  I'll modify the paper accordingly.

∂28-Jun-77  0958	JMC  
To:   ijcai-77 at CMU-10B   
lee,
Thanks, it will be done as you say.
		John McCarthy

∂28-Jun-77  0032	JMC  
To:   blohm at SUMEX-AIM    
The telephone number of LOTS is 497-3214.

∂27-Jun-77  2333	JMC  
To:   RDR    
Good thought.

∂27-Jun-77  2332	JMC  
To:   LES    
 ∂27-Jun-77  2247	FTP:DanG at SRI-KL (Dan Gerson)	Dialnet opening   
Date: 27 Jun 1977 2248-PDT
From: DanG at SRI-KL (Dan Gerson)
Subject: Dialnet opening
To:   JMC at SAIL
cc:   DanG

After hearing your talk on Dialnet at the Hobby computer conference up
in SF a while back, I have been interested in following what is happening.
Then at tonight's PCNET meeting you mentioned that a position is open for
a programmer to implement the protocols.  I was wondering what the
job responsibilities, qualifications, time demands, and salary would be
for such a job.

Thanks,
Dan
-------

∂27-Jun-77  1933	JMC  	My invited paper.  
To:   ijcai-77 at CMU-10B   
It will be 7 pages.  I can mail it tomorrow, but any time for revision
will be appreciated.

∂27-Jun-77  1432	JMC  
To:   TOB    
I have decided that the AI Lab won't accept Rybak at all.  I'll explain.

∂26-Jun-77  1827	JMC  
To:   ijcai-77 at CMU-10B   
Lee:

I can't do anything, because I have no time and not even a final
version of the paper.  I mentioned what I heard from you previously
in a letter to Sato who has just moved to Tokyo University.  Igarashi
has also moved, so something may have gotten lost.  The paper owed its
inspiration to some lectures I gave at Kyoto, but the model theory results,
i.e. almost all of it, are theirs.  So, if they respond, they respond.
Otherwise, I fear you'll have to give up on it.  I hope the papers you
accepted for full presentation are better than it is.  Sato is very
good.  I fear that theoretical papers may have gotten short shrift;
perhaps there should be a section for relevant theory at the next
conference.

∂26-Jun-77  1656	JMC  	IJCAI paper   
To:   PAT    
Do you know how they intend to handle titles?  Will they run across
two columns?  The title of this paper is Epistemological Problems
of Artificial Intelligence.  Find out how much space the page estimate
gives for expansion.  If it's less than one of these pages, I think
I'll ask for one more page.

∂26-Jun-77  1649	JMC  	IJCAI paper   
To:   PAT    
IJCAI.XGP[E77,JMC], whose source is IJCAI.C, is a complete draft.
First please figure out how many pages it will be and mail the
result to IJCAI-77%CMU-10B.  Then please make a paste up for them.

∂26-Jun-77  1110	JMC  
To:   pratt at MIT-AI  
Thanks for your comments: Since Carolyn Talcott, a graduate student
and already a PhD in Chemistry, is helping me rewrite the notes
for my Fall class which will be given on Stanford's instructional
TV, they are particularly helpful, and I'll send you a copy of the
next draft she gives me.  I have been seriously thinking about replacing
the bold face a and d by italic car and cdr, just to reduce the number
of notations.  However, the primary objective of the BB notation is
still something that will look good in a book, so it doesn't deter
me that it isn't exactly convenient as an input notation.  Look at it
this way: Even in the long run when terminals are super, it will still
be justified to make the machine do a lot of work to produce good-looking
and easily readable output that it won't be justified to make a human
do for input.  On the other hand, there is no need to have unnecessary
differences.

	I will study your ideas about how best to go beyond pure LISP
this week - as soon as I have sent of my IJCAI paper.  My tentative
idea was to have an Algolic structure for that, which would use statements
like "cadar x ← y" to make replacements.  I have a whole song that I'll
sing for you sometime about how one should have a class of entity formed
by Cartesian product that is used non-algebraically.  Thus while an
employee record is the Cartesian product of a name and a salary (say),
it is not like a complex number, because we never form new employees
by algebraic operations on old ones.  Most networks used in AI programs
have that same usage characteristic though a more complex structure.
These ideas haven't resulted in notational proposals yet, though.

∂26-Jun-77  1052	JMC  
To:   CLT    
Carolyn: Here are some typos and other comments from Vaughan Pratt at
M.I.T.

 ∂26-Jun-77  1002	FTP:PRATT at MIT-AI (Vaughan Pratt)
Date: 26 JUN 1977 1305-EDT
From: PRATT at MIT-AI (Vaughan Pratt)
To: jmc at SU-AI
CC: (FILE [PRATT;LISP MAIL]) at MIT-AI

Are you interested in typos and other remarks for "Recursive
Programming"?  Here's a bunch.  (6,-3 means 3rd line up from bottom of
page 6.  I'll just give the corrected form.  Things in parens are
remarks rather than corrections.  If you don't have a copy with this
numbering and care about the typos, I'll just mail you this copy and
you can mail me a fresh one.  Come to think of it, other order since I
wouldn't like to be without it for more than a day.)

6,8	PLUS.

13,14	expressions

13,19	programs

15,-2	(You ought to disown such an implementation.)

16,11	(then why is difference[x,y] denoted by x-y?  Certainly not
because it is associative.))

16,-2	Here

18,8	(You ought to mention that these examples are over the natural
numbers rather than the integers.  Otherwise your definition of mod
doesn't make sense.)

21,-12to-5	(Did you intend the prettyprinting to turn out that
way, or is there a difficulty with your prettyprinter?)

26,middle+2	...compilers that know that multiplication is
associative should...

27,-9	(Thought it was Cadiou, but I'm not entirely sure)

36,-1	and

38,13	(I don't know, maybe one day machines will be so cheap and
people so fussy about their user interface that code generation will
be considered the side issue, if in fact any code generation is done
at all.)

39,first line of code	c(ac)

40,7	<subr>

40,11	your

44,4-7	(To avoid this, which has nothing to do with compiling, how
about making the output a list?  That should approximately halve
"file", which seems to be doing two different things anyway, unless
you consider DE to be something associated with files.)

48,-13	append

70,middle	non-terminating

77,15	(You probably should give the expression, in the absence of
exercises bringing the user up to the necessary expertise to do it
himself.)

What are you planning to do with "Recursive Programming?"  I would
think it would make an excellent monograph on pure LISP.  I am getting
to the point where I would like to do all my programming in pure LISP.
Unfortunately our LISP compiler, by not doing a good job on eliminating
recursion, inter alia, doesn't encourage this, and so to continue to
cope with large problems I have to continue to program with loops and
setq's, which makes it hard to form good programming habits.

∂25-Jun-77  0956	JMC  
To:   ijcai-77 at CMU-10B   
Title: Epistemological Problems of Artificial Intelligence
I've got to finish this weekend.
	John McCarthy

∂25-Jun-77  0250	JMC  
To:   DON    
I didn't know game could end before I got all treasures home.

∂24-Jun-77  1749	JMC  
To:   pbaran at USC-ISI
To Dave Caulkins:

I would like to come to your PCNET meeting on Monday, and, if there
is time and it is convenient, discuss compatibility between Dialnet
and PCNET.
				John McCarthy

∂23-Jun-77  1547	JMC  
To:   TJW    
No present problem with July 18-22.

∂23-Jun-77  1300	JMC  
To:   pratt at MIT-AI  
% signals a font change to pub.  I don't know how it works directly.
Jeff Rubin would know and is here at the moment.  I would do more
myself, but I'm worried about finishing my paper.

∂23-Jun-77  1250	JMC  
To:   pratt at MIT-AI  
According to the table on my terminal, that seems to be correct.

∂23-Jun-77  1150	JMC  
To:   pratt at MIT-AI  
I don't know about underline, but %2 preceding and %1 following text will
put it into italics provided the first line of the file is

.require "suitable" source;

where suitable (which must be surrounded by quotes) is a file that
defines a page size and fonts.  MEMO.PUB[LET,JMC] is a suitable file.
MEMO.PUB has much more in it than necessary, so maybe I can get someone
to make up a suitable file and put it in your directory here if you
can give the full set of facilities you want.

∂23-Jun-77  1053	JMC  	LISP article  
To:   pratt at MIT-AI  
I have a great interest in your LISP encyclopedia article, but I won't
be able to react till I have finished and sent off my IJCAI paper.  I
will need to print a copy here.

∂21-Jun-77  2223	JMC  	Dialnet and Mark Crispin
To:   tk at MIT-AI, rg at MIT-AI 
We are thinking of offering Mark Crispin a job as implementer
of Dialnet - a system for communicating between computers in
an ARPAnet-like way over dial-up telephone connections.  I would
like to discuss his qualifications, and get your reactions to the
project.  When would be a good time to telephone?

∂20-Jun-77  1652	JMC  
To:   DEW    
I am sorry not to have had more time to talk, because your topic is one
that interests me.  I'll need a real lesson some time soon.  This week
I'm working on my IJCAI paper so we should get together next week.

∂20-Jun-77  0934	JMC  
To:   CLT    
We need to find you a new place to sit.  Please call me.

∂20-Jun-77  0035	JMC  
To:   GFF    
1. I believe the baud rate is 1800, but it may be 1200.  It is not as
fast as one would like, but the main delays come from slowness of the
time-sharing system and not from an inadequate modem.

2. The line charges are something like $22.00 per month.

3. The modems are Sangamo and cost about $800 per end about 5 to 7
years ago.  They have been entirely reliable.

∂16-Jun-77  0133	JMC  	Trading the Cyber 76 for Shcharansky, Lerner, et. al. 
To:   ef at MIT-AI
Please read DEAL[S77,JMC].  It proposes to trade the Cyber 76 for
the release of various refuseniks and dissidents.  It explains why
such a deal is to our advantage and why the Soviets may go for it
anyway.  My interpretation of the experience with getting Lerner
into the meeting is that a small material concession on our part
can produce large moral concessions on theirs.

∂15-Jun-77  2107	JMC  
To:   RWW    
nsf[s77,jmc] is a start on an nsf proposal.

∂15-Jun-77  1759	JMC  
To:   RCM    
Proofs of ¬provable require a schema.

∂15-Jun-77  1637	JMC  
To:   RCM    
What is the state of your plan to go to SRI?

∂15-Jun-77  1550	JMC  
To:   PAT    
Someone else sent me a copy of Dyson article.

∂15-Jun-77  1453	JMC  
To:   WP
Thanks.  I had forgotten we had moved it there.

∂15-Jun-77  1452	JMC  
To:   DPB    
No wonder I couldn't find the draft syllabus.  It had already been moved
to QUALS.ALL[INF,CSD].  Now I remember I did that a month ago.

∂15-Jun-77  1128	JMC  
To:   PAT    
Please get me a xerox of the Dyson article.

∂14-Jun-77  2325	JMC  
To:   WP
I have forgotten where I told you the MTC syllabus was located.

∂14-Jun-77  1414	JMC  
To:   DPB    
There is a new syllabus that Zohar made.  I'll have to find it.

∂13-Jun-77  1333	JMC  
To:   reddy at CMU-10B 
To Beverly Howell:
You didn't send the notification to me on the paper by Hayashi et. al.
This is a repeat, since there may have been a transmission error.

∂13-Jun-77  1050	JMC  
To:   RAJ, JMC, reddy at CMU-10B 
To Beverly Howell:
You didn't send the notification to me on the paper by Hayashi et. al.

∂12-Jun-77  1641	JMC  
To:   TED    
The terminal in Martin Davis office sings terribly.

∂12-Jun-77  0133	JMC  
To:   ef at MIT-AI
I think you might be good at seeing an ambassador.  I don't think I am.
I just got back from a trip.  I'll think of some more ideas.

∂12-Jun-77  0127	JMC  
To:   ef at MIT-AI
PROPOSED TELEGRAM ABOUT SHARANSKY

	The prosecution of the computer scientist Sharansky, which we
regard as motivated by his desire to emigrate and his work in monitoring
compliance with the Helsinki agreement, will have a very negative effect
on Soviet-American co-operation and contacts in the computer field.  The
prosecution reminds us of the 1930s, and we hope it will be dropped.

To Alexandrov - USSR Academy of Sciences
To Rudenko - USSR Public Prosecutor
cc. U.S. National Academy of Sciences
cc. U.S. State Department
cc. U.S. ambassador to the U.N.

Potential signers
Herbert Grosch - President ACM

John McCarthy - Computer Science Dept., Stanford,yes

Edward Fredkin, M.I.T.,yes

Marvin Minsky, M.I.T.

Alistair Holden, Univ. Washington,yes

∂11-Jun-77  2146	JMC  
To:   RAK    
If it ain't broke, don't fix it. - Bert Lance

∂09-Jun-77  1046	JMC  
To:   RWW    
 ∂09-Jun-77  1025	RWW  	NSF PROPOSAL  
Would you like me to do anything, we probably should start soon.
Yes, we should start next week.

∂09-Jun-77  1045	JMC  
To:   TOB    
I have no more money for any kind of project.

∂09-Jun-77  0221	JMC  
To:   EF at MIT-AI
What result with Michie?

∂08-Jun-77  2043	JMC  
To:   CLT    
I can now offer you half time assistantships for summer and fall.

∂07-Jun-77  2337	JMC  
To:   JAB
CC:   LES   
There is something called the X-25 protocol for information transmission,
and EDUCOM is supposed to be using it.  Professor Gene Franklin knows who
knows about it.  Please find out if it is something we should use.

∂07-Jun-77  2334	JMC  
To:   LES    
I say my unrestricted funds are broke.  Until I get an NSF grant for
theory, I am running into the hole and will eventually be forced
to lay off RWW.

∂07-Jun-77  1150	JMC  
CC:   LES    
Already sent to JAB
I know no such reason.  However, we still have to go through the
procedure of listing the job.  We have never failed to get the person
we want so the risk to you seems negligible.  My experience suggests
that if you tell D.E.C. that you prefer the Dialnet job, but would take theirs
in case of a hitch and need three weeks, the probabilities are that
they'll keep their offer open, and it would have a good long range
effect if you ever want to work for them in the future.

∂07-Jun-77  1133	JMC  
To:   JAB    
I know no such reason.  However, we still have to go through the
procedure of listing the job.  We have never failed to get the person
we want so the risk to you seems negligible.  My experience suggests
that if you tell D.E.C. that you prefer the Dialnet job, but would take theirs
in case of a hitch and need three weeks, the probabilities are that
they'll keep their offer open, and it would have a good long range
effect if you ever want to work for them in the future.

∂06-Jun-77  1657	JMC  
To:   ef at MIT-AI
The file is SHARAN.RE1[LET,JMC].

∂06-Jun-77  1650	JMC  
To:   ef at MIT-AI
I got your message, and doubt that prisoners are allowed to receive
telegrams, but we can send it anyway.

∂06-Jun-77  1624	JMC  
To:   ef at MIT-AI
PROPOSED TELEGRAM ABOUT SHARANSKY

	The prosecution of the computer scientist Sharansky, which we
regard as motivated by his desire to emigrate and his work in monitoring
compliance with the Helsinki agreement, will have a very negative effect
on Soviet-American co-operation and contacts in the computer field.  The
prosecution reminds us of the 1930s, and we hope it will be dropped.

To Alexandrov - USSR Academy of Sciences
To Rudenko - USSR Public Prosecutor
cc. U.S. National Academy of Sciences
cc. U.S. State Department
cc. U.S. ambassador to the U.N.

∂06-Jun-77  1252	JMC  
To:   PAM    
I will make up the exam and administer it, but I must go to Washington
on Thursday, so I want to have a big grading party Wednesday night
starting 8pm here.  We will grade the exams and the projects and make
out grades.

∂06-Jun-77  0147	JMC  
To:   DCL    
The other names are saved core images of partial games - not disguises.

∂02-Jun-77  2236	JMC  
To:   gls at MIT-AI    
Dr. Herbert Stoyan
DDR 806 Dresden
Togliattistr. 40
East Germany∞

	I think it is entirely worthwhile helping him.  The best thing
you could do would be to find reports from Research Laboratory of
Electronics mentioning LISP and send him copies.  RLE has a document
room and Fredkin could probably finance the copying.  If you read
German, I could sent you his drafts.

∂02-Jun-77  2229	JMC  
To:   RDR    
The points you make are good but not necessarily decisive.  As long
as LOTS remains as inexpensive as it is, there is no need for fees.
The range of usage between 15 percent and 50 percent is the range
of maximum potential strain.  You realize that LOTS could not itself
decide for fees.  The University would indeed have to decide to
reverse all the traditions you mention.

∂02-Jun-77  0612	JMC  	IJCAI paper   
To:   PAT    
Please U.S. mail a copy of MINIMA.XGP[S77,JMC] to Raj Reddy at CMU.
The paper will have to be converted into the proper form for IJCAI
proceedings to get there by June 15.

∂02-Jun-77  0606	JMC  	my IJCAI paper
To:   reddy at CMU-10B 
I will mail you the written paper today for reviewing.  I had thought
to combine all my recent work on epistemological questions into one
paper, but it didn't jell.  Therefore I have decided to submit only
a short and rather technical paper for the written proceedings.  It
is just seven pages and is entitled "Minimal inference - a way of
jumping to conclusions".  I will be able to put it into the form
desired for the proceedings by June 15, and I may make a few minor
changes as well unless I solve a problem I am thinking about -
in which case the changes will be larger, but won't increase the
size much.  I may cover more topics in my oral presentation.

∂02-Jun-77  0338	JMC  
To:   DON    
I would like a copy.

∂01-Jun-77  1337	JMC  
To:   RWW, CG, WP, DCL, RAK 
 ∂01-Jun-77  0957	FTP:Boyer at SRI-KL	Talk by Woody Bledsoe    
Date:  1 Jun 1977 1150-PDT
From: Boyer at SRI-KL
Subject: Talk by Woody Bledsoe
To:   ccg at SU-AI, jmc at SU-AI


Title:  A Maximal Method for Set Variables in Automatic Theorem Proving
        W.W. Bledsoe 

Abstract:  A procedure is described which gives values to set variables
in a theorem.  This techniques has been used to prove theorems in
intermediate analysis (the intermediate value theorem), topology,
logic, and proram verification.  The method is "maximal" in that a
largest (or maximal) set is usually produced if there is one.

Time:  2 p.m.  Tuesday June 7

Place:  237 Digital Systems Lab
-------

∂01-Jun-77  0920	JMC  
To:   REG, RDR, DPB, CGN, WTL, MRB, MJC, ARS, PLW
To:   wiederhold at SUMEX-AIM   
I think SAIL is OK as far as speed goes though not great.  When SAIL
was written, I believe they neglected speed for features though not
to the extent of some other languages.  Ralph Gorin (REG at SAIL)
has made some comparisons and should be included in this discussion.

∂01-Jun-77  0918	JMC  
To:   REG    
 ∂01-Jun-77  0900	FTP:Wiederhold at SUMEX-AIM	(Response to message) 
Date:  1 JUN 1977 0900-PDT
From: Wiederhold at SUMEX-AIM
Subject: (Response to message)
To:   JMC at SAIL, RDR at SAIL, DPB at SAIL, CGN at SAIL,
To:   WTL at SAIL, MRB at SAIL, MJC at SAIL, ARS at SAIL,
To:   PLW at SAIL

In response to the message sent 31 May 1977 1554-PDT from JMC at SU-AI (John McCarthy)

In response to your message sent 31 May 1977 1554-PDT

I believe a choice of language will be a concern for many, and
adequate performance at LOTS is an important, and underrated concern. After
using BLISS, and having to give up assigning homework in CS140B
because of intolerable compiletimes I have been super-sensitized.
I do believe that a compiler of the scope of ALGOL-W or Pascal
can both compile fast, avoid excessive recompiles due to the
straightforwardness of the languagr, and generate efficient code
for programs where listproceessing is not the dominant
aspect.
How does SAIL rate in your assessment?
The current state of CHIRON precludes judgement, the compiling
and execution times may be initially large, the error recovery
aspects may reduce the frequency of recompilation.
Gio
I think SAIL is OK as far as speed goes though not great.  When SAIL
was written, I believe they neglected speed for features though not
to the extent of some other languages.  Ralph Gorin (REG at SAIL)
has made some comparisons and should be included in this discussion.

∂31-May-77  2118	JMC  
To:   jab at MIT-ML    
EGK was driven from LOTS, and I received a polite note of apology
promising not to use our machines without permission.
However, Dick Karp (RAK) just encountered someone else (AVB)
who claimed you told him it would be OK to use the machine at night.

∂31-May-77  2116	JMC  
To:   JAB, LES    
Suggest Monday at 2pm.

∂31-May-77  2112	JMC  
To:   RAK
CC:   LES   
Borchek is in Boston, so it must have been before.  I noticed AVB
but wasn't in a mood to give chase.  I trust you repelled the
invasion.

∂31-May-77  1943	JMC  	Videocomp
To:   DEK, LES    
According to an III stockholders' brochure the American Institute of
Physics has acquired a Videocomp 500.  They are the publishers of
Physical Review and the other physics journals.  Therefore, they must
have a plan to typeset mathematical formulas.

∂31-May-77  1554	JMC  
To:   wiederhold at SUMEX-AIM, RDR, DPB, CGN, WTL, MRB, MJC, ARS, PLW    
Students who take 105 and 106 will want to use the language
they learned in that course afterwards.  If this language is too
inefficient, it may swamp LOTS.  Apparently ALGOL W was OK, and I
hope CSD will choose a language that is no worse.

∂31-May-77  0031	JMC  	Pay for comments.  
To:   moses at MIT-ML  
I sent in my comments on the Future Study papers in early May, and I
believe I was supposed to be paid on receipt.  Could you find out the
situation?

∂30-May-77  2209	JMC  
To:   egk at MIT-MC    
Your apology is accepted.  I was somewhat short-tempered, because I am
being pressed by users of both AI and LOTS complaining aobut lack of
compute capacity, and you were on both machines at crowded times.  At
uncrowded times, requests for limited use for something of mutual
interest can sometimes be honored.

∂30-May-77  2152	JMC  
To:   Dertouzos at MIT-MULTICS   
Where's my money?

∂30-May-77  1940	JMC  
To:   JP
Network working group is at office-1, I believe.

∂30-May-77  1704	JMC  
To:   DON    
What are you using the computer for these days?

∂31-May-77  0727	JMC  	UNKNOWNs 
To:   JBR    
How can I wipe out a user, deleting all files.  Would you wipe out KLH,
who logged out when I asked him who he was?  He comes in on the AMES TIP.
Does a disk purge wipe out unknowns.  ENDGAM.dmp in his area is a game
that should be wiped out if all its incarnations could be found.  KLH
was using MAIL so there is probably another like him.

∂30-May-77  0025	JMC  
To:   JAB    
I haven't had that problem, so I don't suppose it will happen often.

∂29-May-77  2304	JMC  
To:   JAB
CC:   RAK   
An UNKNOWN called EGK was challenged by RAK and said he was a friend
of JAB.  Using this machine is not a transitive relation.

∂28-May-77  1830	JMC  
To:   PAT    
Please print HAYES.XGP[LET,JMC] and included FIRST, EXOTIC, MINIMA,
CONCEP, and MENTAL.

∂27-May-77  1902	JMC  
To:   wilber at SRI-KL
CC:   moon at MIT-MC    
I am sorry to have to say this, but I am afraid that the LISP articles
are unsalvageably bad - at least with the time I am willing to give it.
The main problem is that the examples are written as though they were
Fortran programs, i.e. almost all PROGs.  Someone with more time might
be of more assistance.

∂27-May-77  1614	JMC  	reference to my paper   
To:   phw at MIT-AI    
If you do a second edition and continue to refer to my "
Basis for a Mathematical Theory of Computation", you should
refer to the corrected version in Braffort and Hirschberg
Computer Programming and Formal Systems rather than the
WJCC version.  I am enjoying the book.

∂26-May-77  2233	JMC  	Forged signature.  
To:   WD, gjs at MIT-AI
CC:   RWG    
A message you apparently received from RWG commenting on libel in M.I.T.
sex ratings was really from me.  Because of Imlac lines being switched,
my terminal was left logged in as RWG.

∂26-May-77  2228	JMC  	Inadvertently reading your mail.  
To:   RWG    
When the Imlac port was switched back to my line, you were left logged in,
and when I typed et∂, I got your mail file.  The last message was from
WD and concerned the sex performance rating scandal at M.I.T.  I imagined
that the message had been copied to my mail file somehow, and I commented
on the message in  a message to WD and to GJS at AI.  The message therefore
went out in your name.

∂26-May-77  1531	JMC  
To:   gls at MIT-AI
CC:   RPG   
You will be welcome at SAIL at time mentioned.  Anything you can do
or advise to help implement your changes at the LOTS Decsystem 20
site will also be much appreciated.

∂26-May-77  1038	JMC  
To:   JBR    
The answer you received from ME confirms the opinion that we made the
right decision about him.

∂26-May-77  0038	JMC  
To:   JRA    
Do you have a spare copy of your book that could be sent to Stoyan in Dresden?

∂25-May-77  1854	JMC  
To:   MJL, dbrown at SUMEX-AIM, feigenbaum at SUMEX-AIM   
Farmwald though his adviser was Feigenbaum, but hadn't seen him in a long
time and wanted me to be his adviser.  Assenting to this, I have moved
him from the list of unknowns to my list.  I trust this is ok.

∂24-May-77  0002	JMC  
To:   bobrow at PARC-MAXC   
Here are my answers to your questions:

Q. What are the most important premises underlying your approach to
knowledge representation, the critical ideas, and major mechanisms
used in your system?

A. At present I am trying to identify the facts about the world
that must be used in solving various kinds of problems and the modes
of reasoning available to find and validate proposed solutions.
An important premise is that the epistemological problem of what
knowledge is available to a problem solver with given opportunities
to observe and compute is substantially separable from the heuristic
problem of how then to decide what to do.  In the present stage of
research there is no "system" in the sense of a program, although
I use our proof-checker to see what the reasoning looks like.
It is also a premise, so far verified by experience, that first order
logic, i.e. extended predicate calculus, is convenient for expressing
these facts about the world.  It should be emphasized that
first order logic itself does not correspond to a language, it is rather
a basic notation within which languages can be developed.  Thus if one
first order language is found inadequate for some purpose, others
with entirely different characteristics can be tried.

Q. If your representation were being used as a basis for a system which
would conduct typed English dialogs with a user about some subject,
what aspects would your knoweldge representation make easiest;
what aspects would best be handled by building additional mechanisms.

A. Predicate calculus representations of the knowledge expressed
in English is feasible, but more difficult than has been realized
in the past.  The problem has nothing to do with the syntax of natural
languages but with the dependence of the semantics on context.  The
best work so far in this direction is Richard Montague's "English as
a Formal Language" and possibly some of the work of his followers.
However, this work does not so far take into account much of what has
been accomplished in AI, and I would do many things differently.

	While I do not expect to develop a running "Advice Taker" in
the near future, I have thought a lot about it.  While first order
logic formulas in LISP notation would be used to represent some information,
most information would be compiled into more purpose-oriented internal
forms before use.  First order logic might well be used for
communicating information.

	None of this has much relation to Kowalski's proposals to use
predicate calculus as a programming language.  I agree that this can
be done, but I have not yet seen anything to convince me that it has
many advantages as a programming language.

Q. What problem illustrates what you believe your system is best at,
and is difficult for some representations?  Point out which of your
premises and/or ideas make it possible to handle your problem
cleanly.

A. Since I don't have a "system", it is difficult to respond
precisely to the question, but here are some things that I know
how to do that I think will offer difficulty to the "systems" that
I know about.

	1. "Travel agents know what flights are available between
two cities but don't know the gates from which the airplanes leave.
They have general information about the air travel system".
A system should be able to receive this fact, in some notation,
on its input and know how to find out how to get somewhere, and know
enough to ask the travel agent how to find the gate.

	2. When asked whether President Carter is standing or
sitting a this moment, a program should say it doesn't know,
and when asked to think harder, it should say that more thinking
wouldn't help, because, as far as its information goes, he could
be doing either.  This reply should not be made if the program
has direct information about his posture.

	3. When told that Mary has the same telephone as Mike,
that Pat knows Mikes telephone number, and that Pat dialed
Mike's telephone number, the program should assent to the statement
that Pat dialed Mary's telephone number, and express ignorance
about whether Pat knows Mary's telephone number.

	4. When told the missionaries and cannibals problem in
English or in first order logic, the program should
behave differently hearing it as a puzzle and when hearing it
when it believes it is sitting by the river in a jungle.
In the former case it should reject the possibility of a bridge
across the river or a lack of oars for the boat.  In the latter
case, it should find a solution tentatively rejecting them, but
should admit them as possibilities.  It needs entities like
"a lack of oars" in order to answer questions like "What's wrong
with the boat?" and "Is that all that is wrong with the boat?".

	My general approach is described in McCarthy and Hayes
"Some Philosophical Problems from the Standpoint of Artificial
Intelligence", but most of what I have just said is based on
three as yet unpublished memoranda "First Order Theories
of Individual Concepts", "Minimal Reasoning - A Way of Jumping
to Conclusions", and "Ascribing Mental Qualities to Machines".

∂23-May-77  1613	JMC  
To:   DEA    
The last day of classes June 2 would suit me best.

∂23-May-77  0036	JMC  	Scheduler
To:   JBR    
I suggest that the scheduler treat heavy disk users in the same way
it treats heavy compute users.  Namely, they should be put, once they
have revealed themselves, into a secondary queue in which they compete
against each other, and are brought, one at a time, into core,
where they remain long enough to get something done.

∂22-May-77  2311	JMC  	LA trip  
To:   PAT    
I have PSA reservations Flight 264 at 1:20pm San Jose to L.A.
on Tuesday and Flight 463 at 4:20pm on Wednesday return.  Please get
me tickets.

∂22-May-77  1749	JMC  	Meeting with Stu Wecker 
To:   LES, JAB, JBR, REG    
Meeting on Dialnet with Stu Wecker will be at 11am Monday.

∂22-May-77  1658	JMC  
To:   JAB    
You can come.  Meeting may be at 11 though.  I'll mail you a note if so.

∂21-May-77  1421	JMC  
To:   JBR    
Good question:  How much disk transfer do we deliver in a period of
several minutes during which there remains a substantial disk queue?

∂21-May-77  0914	JMC  
To:   ME, ALS
E seems to have the following bug - at least on an Imlac.  If a line overflows
what can be displayed on one screen line and then is shortened to fit by
deleting charact⎇rs from the early part, there appear two identical lines
when the user does <ctrl><cr>.  It's not a serious bug, because the
extra can be deleted, but it makes a user nervous, because one can
wonder whether E is fully aware that it has two lines.

∂21-May-77  0910	JMC  
To:   pratt at MIT-AI  
We killed our PARRY.  A message to COLBY%SUMEX might locate one you could use.

∂20-May-77  1550	JMC  
To:   bobrow at PARC-MAXC   
My mail file with questions got erased.

∂20-May-77  1345	JMC  
To:   LES    
05-23	Stewart Wecker of D.E.C.,9:30am from Holiday Inn,617-897-5111x4366

∂19-May-77  1459	JMC  
To:   * 
Dialnet lives.  NSF promises support.

∂19-May-77  1440	JMC  
To:   LES    
we have just got official word from NSF supporting Dialnet.

∂19-May-77  1439	JMC  
To:   REM    
We have just received official word that NSF will support Dialnet.

∂18-May-77  2149	JMC  	Dialnet  
To:   REM    
Les told me some group you are connected with was thinking
about using the name Dialnet1 for something they were thinking
of doing.  I hope that won't be done.

∂18-May-77  1021	JMC  
To:   wilber at SRI-KA 
I will be willing to look over the articles.  What time will you come?

∂18-May-77  1009	JMC  
To:   REM    
Get rid of all lines beginning with .. Then get rid of all %<character>
in the text.  There may be a little garbage left, but the text will
be quite readable.

∂17-May-77  2330	JMC  	AI Qual results    
To:   MJL    
Ron Goldman and Doug Appelt passed.
Rich Pattis and Mike Farmwald failed but could probably pass on
a second try.
Robert Filman passed with the condition that he successfully complete
CS390 next fall.  Bruce Buchanan will supervise it.

∂16-May-77  1927	JMC  
To:   DEW    
My immediate reaction is that tree communication may not be needed for thesis.

∂15-May-77  1932	JMC  	message to comprehensive committee
To:   MJL    
	I think this was a good exam, but I think that 10 points devoted to
proving correctness of programs was too few; it should have been more like
50.

			John McCarthy

Could you send the above to the members of the latest committee?

∂15-May-77  1220	JMC  
To:   pratt at MIT-AI  
What encyclopedia is it?  It seems to me that an encyclopedia article
ought to be based on its subject as it is, not as the author thinks
it should become.  Remarks on the latter are more appropriate for
a concluding section than for an introduction.  I would be interested
in commenting on drafts of the article.

∂15-May-77  0113	JMC  
To:   REF    
You passed conditionally.  Please call me.

∂14-May-77  1710	JMC  
To:   JAB    
whenever you can catch me

∂12-May-77  1403	JMC  
To:   wilber at SRI-KL 
I am responsible for both the theoretical and practical development of
LISP.  car and cdr were devised in late 1956 in connection with what
later became FLPL (Fortran list processing language) designed and
implemented by Gelernter and Gerberich at IBM.  The first LISP programs
were written in the fall of 1958, and an interpreter was working sometime
in 1959.  The first paper "Recursive functions of symbolic expressions
and their computation by machine" appeared in CACM April 1960, but appeared
earlier as report of the M.I.T. Research Laboratory of Electronics.
LISP was first implemented on the IBM 704, the immediate predecessor of
the 709.  There is a transcript of a speech giving some of this history
and if you read German, I have a copy of a fuller history by Herbert
Stoyan of Dresden.

∂11-May-77  1352	JMC  
To:   LES    
05-23	Stewart Wecker of D.E.C.,10:30am from Holiday Inn,617-897-1511x4366

∂10-May-77  2215	JMC  	hackers  
To:   mrc at MIT-AI    
I imagine that hackers are a figment of Weizenbaum's imagination and that
he has no-one in particular in mind.  Therefore, it may shake him slightly
that some real person takes his remarks personally.  However, he will
quickly recover.

∂10-May-77  2106	JMC  
To:   JBR    
Would you kill off TOG again?  His directory is protected.

∂10-May-77  1346	JMC  	AI Qual  
To:   nilsson at SRI-KL, winograd at PARC-MAXC, CCG, DCL
To:   feigenbaum at SUMEX-AIM, buchanan at SUMEX-AIM   
The AI qual is Saturday May 14 starting 10am in 204 Polya.  We will then
divide the examiners into two groups and take the examinees one at a time.
Moira Lieberman or Patte at the AI Lab or AIQUAL[S77,JMC] has a list of
questions the examinees are asked to prepare.

∂07-May-77  0834	JMC  
To:   JBR    
I was referring to people in the ARPANET directory who have no
connection with the Lab.

∂06-May-77  2232	JMC  
To:   JBR    
There seem to be many ringers.  I have removed some.  Why not all?

∂06-May-77  0708	JMC  
To:   PAT    
 ∂05-May-77  2158	FTP:Geoff at SRI-KA	Your DIALNET Interest list.   
Date:  5 May 1977 2159-PDT
From: Geoff at SRI-KA
Subject: Your DIALNET Interest list.
To:   JMC at SAIL

Could I please be added to the DIALNET List?

Geoffrey Goodfellow,
Artificial Intelligence Center,
Stanford Research Institute,
333 Ravenswood Ave,
Menlo Park, Calif.  94025.
ARPANET:  GEOFF@SRI-KA

It would be nice if DIALNET and our Packet Radio net could be interfaced
to each other at sometime.  I hope there will be provisions for such in
the protocols.
-------

∂05-May-77  2004	JMC  
To:   ZM
See you Friday.

∂05-May-77  2003	JMC  
To:   katz at USC-ECL  
If you send me a U.S. mail address, I'll send you a blurb on dialnet;
better send it to my sec'y Patte Wood, PAT@SU-AI.

∂05-May-77  2000	JMC  
To:   LES, PAT    
For Dialnet list.
Einar Stefferud, Network Management Associates, Inc.
Huntington Beach, California  92647
(714) 842-3711
STEFFERUD@USC-ISI

∂05-May-77  1958	JMC  
To:   REG    
Please arrange meeting with Wiederhold on his ideas on LOTS improvements.

∂03-May-77  2312	JMC  
To:   DGR    
I have been abroad for two weeks which is partly why you haven't heard
anything.  The other part is that we still don't have final word from
NSF, even though the papers left the computer division a month ago.
When we have that word we can hire someone, and I want him to be in
on the major decisions.  As soon as this happens, I'll get back to you.

∂03-May-77  1805	JMC  
To:   bobrow at PARC-MAXC   
Yes, please send them again.

∂03-May-77  1804	JMC  
To:   VDS    
Platonov claims you promised Vicarm movie in exchange for his.

∂17-Apr-77  0350	JMC  	CS206    
To:   PAM    
Please print the remaining chapters of the course notes and
distribute them.  The chapter on proving programs correct
is not in very good form but will have to be distributed as
is.  It is the file THEORY[S77,JMC] and needs to replace the
corresponding chapter in LSPDOC[206,LSP].  The chapter on
compilers needs to have the compilers revised slightly to work
in MACLISP at LOTS.  Dick Gabriel has agreed to do this.

∂17-Apr-77  0045	JMC  	Your proof.   
To:   RWW    
	I am looking forward to reading the proof and its
satellites in the plane.
Will the proof extend to a proof that
samefringe[x,y] ≡ fringe x = fringe y?  Presumably the induction
is the same; only the formulas are longer and need more
simplification.  However, it would be good to try it.

	"primative" → "primitive"

Let me suggest you send a copy to Boyer and Moore at SRI to see
whether they think their automatic prover can do as well.  You might
send a copy to gether with a copy of FIRST to Cartwright at Cornell.

∂16-Apr-77  1744	JMC  
To:   RWW    
Many thanks.

∂16-Apr-77  0124	JMC  
To:   RWW    
I leave Sunday morning.

∂14-Apr-77  2125	JMC  
To:   ELM    
What latency and transfer rate?

∂14-Apr-77  1403	JMC  
To:   JB
Suppes kindly accepted.  To assert gladly, you should know him better.
By the way, he promptly called me with a request to be on a committee
for one of his.

∂13-Apr-77  1252	JMC  
To:   DPB    
Better you than me.

∂13-Apr-77  0932	JMC  
To:   quam at SUMEX-AIM
3:30 PM here only remaining possibility.

∂13-Apr-77  0909	JMC  
To:   quam at SUMEX-AIM
CC:   RWW    
Yes to a meeting on Wagner thesis. Thursday 4:30?

∂12-Apr-77  2344	JMC  	Smith    
To:   FRM    
It is not permissible for people to login under the names of others.
Smith cannot be added to the group without agreement.  Music used 36%
in March (including 220).  All other research got 37%.  Smith was playing
go last night and when asked to stop, copied the go program under another
name and continued.

∂12-Apr-77  2344	JMC  
To:   NR
OK for now. I'll talk with Chowning.

∂12-Apr-77  2319	JMC  
To:   RP
CC:   JC
Music including 220 is now was 36% of computer use in March and
non-music research was 37%.  In view of this, there was to be
agreement on the addition of new people to the music group.  To add
people to the 220 list and then have them do other work is not
in accordance with the agreement.  Rolnick should stick to 220 hours
until something else is agreed.

∂12-Apr-77  2303	JMC  
To:   NR
Please adhere to 220 time restrictions.

∂12-Apr-77  2300	JMC  
To:   LES    
When can we have bureaucracy by time of day so we can estimate music use?

∂12-Apr-77  0919	JMC  
To:   nilsson at SRI-KL
AI[W77,JMC] is a reaction to Nilsson, Duda, and Hart.

∂12-Apr-77  0818	JMC  
To:   minsky at MIT-AI 
Good, let's try to collaborate, but I am going to MI9 on Sunday
to return May 2, so we should do something before then.

∂12-Apr-77  0132	JMC  	Julius Smith, sins thereof.  
To:   JC
CC:   LES, DCL    
JOS,FRM was logged in playing go about 11:40 when system was heavily loaded.
Asked to stop, pleaded he had brought friend and was told to come back at
3am.  Soon thereafter, was observed running a program T.  RU T[jos,frm]
showed that it was a newly made copy of go.  He was told to log out and
not log in again till he has seen me.  Is he a musical genius?    One supposes
that he logs in as FRM to avoid 220 restrictions, but many of its files
were created in legitimate 220 hours.  FRM has no other obvious barnacles.

∂12-Apr-77  0131	JMC  
To:   FRM    
Did you know that Julius Smith was using a directory JOS,FRM?

∂12-Apr-77  0052	JMC  
To:   FRM    
Please log out immediately and see me before logging on again.

∂12-Apr-77  0027	JMC  
To:   FRM    
Not exclusively.

∂12-Apr-77  0021	JMC  	Go and two jobs in RUNQ.
To:   FRM    
It is not permissible to have two jobs in RUNQ quite apart from GO.
If you want to finish this one game, come back after 3:00 am.

∂12-Apr-77  0010	JMC  
To:   FRM    
The machine, as usual, is too busy for GO playing.

∂12-Apr-77  0007	JMC  
To:   DCL    
JMS was given special permission to run at other times than early
morning, because of illness.  JOS has no such authorization.  Why
don't you suggest he stop?

∂11-Apr-77  0841	JMC  
To:   dbrown at SUMEX-AIM   
 ∂11-Apr-77  0816	MJL  
$16,149 by end of fall quarter.
year to date expenses    3/3l/77      34,024
Although most CSD courses switched to LOTS in winter, the use of SCIP
in winter was $18,000 as compared to $16,000 in fall.  Can you find out
what it was used for?  We think LOTS needs about $35K in amortization budget in
order to double its speed and disk file and meet fall crunch.  However,
departments and schools are going to have to decide which is more
prioritous for them.

∂10-Apr-77  0138	JMC  	Comments on a report by Nilsson, Duda and Raphael.    
To:   minsky at MIT-AI 
I don't know if you have been sent this report for comment, but
you might look at AI[W77,JMC] and form an opinion if I am being
unfair as well as impolitic.

∂09-Apr-77  1517	JMC  
To:   RAK    
As it happens, Borchek has been working on our accounting system
so that it will take account of time of day.  I suspect that much of the
time charged to him is his version of the accounting system working in
parallel with the old system.  We were paying him last summer but have
got the recent work for free.

∂08-Apr-77  2228	JMC  	LOTS use 
To:   RAK    
One important LOTS use is moving software to LOTS from here and other places.

∂08-Apr-77  2041	JMC  
To:   pratt at MIT-AI  
With the formalisms discussed in "FIRST ORDER REPRESENTATIONS", I expect
to be able to ask students to prove their LISP programs extensionally
correct (i.e. they get the right answers, without saying how efficient
they are).  This will put a premium on writing programs using features
that have formalizable semantics.  We'll see what effect this has on
people's tastes.

∂08-Apr-77  2037	JMC  
To:   MJL    
What was expended by end of Fall quarter since LOTS wasn't active in
the Fall?

∂08-Apr-77  2035	JMC  
To:   LES    
 ∂08-Apr-77  1501	GFS  
GEORGE SCHNURLE WILL BE WORKING ON THE LOTS COMMUNICATION INTERFACE
UNDER THE ACCOUNT NAMED GFS. PLEASE ENTER IT AS A VALID ACCOUNT.

∂08-Apr-77  2034	JMC  
To:   RAK    
Who are the offenders you have noticed?

∂07-Apr-77  2209	JMC  
To:   PRATT at MIT-AI  
I have asked Patty to mail you one.

∂07-Apr-77  2206	JMC  
To:   PAT    
Please send Vaughan Pratt at M.I.T. a copy of FIRST.XGP

∂06-Apr-77  2358	JMC  
To:   pratt at MIT-AI  
I think I agree with your message about EVAL.  I don't use it for programming.
Its original intent was theoretical - to show how much simpler the universal
function for LISP is than a universal Turing machine.

∂06-Apr-77  2215	JMC  
To:   pratt at MIT-AI  
FIRST.NEW[W77,JMC] may interest you.  FIRST.XGP is the pubbed version.

∂06-Apr-77  1919	JMC  
To:   REP    
It will be approximately according to Winograd's 1975 syllabus
available from Moira Lieberman.

∂06-Apr-77  1917	JMC  
To:   JC
OK about Strawn

∂23-May-77  0040	JMC  	Scheduler
To:   JBR    
There might even be a service level system for disk use.